Design and Application of K-Means Method to Predict Sales at Arya Elektrik Stores
نویسندگان
چکیده
In a shop, the product is staple that sold and bought. There are products in store between sell well don't sell. Given this problem, it necessary to create system can classify sell, well, which was carried out at Arya Elektrik Store from March July 2022. The K-Means algorithm not affected by order of objects used. used, proven when author tries randomly determine starting point cluster center one start calculation. number memberships generated same using another object as for center. However, only affects iterations performed. purpose applications analyze sales method. With system, provide convenience benefits analyzing grouping Store, determining classifying selling very selling, less selling. method used collect data observation interviews. application, shop owners see results these products. So, if there look other alternatives so be sold.
منابع مشابه
construction and validation of translation metacognitive strategy questionnaire and its application to translation quality
like any other learning activity, translation is a problem solving activity which involves executing parallel cognitive processes. the ability to think about these higher processes, plan, organize, monitor and evaluate the most influential executive cognitive processes is what flavell (1975) called “metacognition” which encompasses raising awareness of mental processes as well as using effectiv...
Quantization and the method of k -means
T HE THEORY developed in the statistical literature for the method of k-means can be applied to the study of optimal k-level vector quantizers. In this paper, I describe some of this theory, including a consistency theorem (Section II) and a central lim it theorem (Section IV) for k-means cluster centers. These results help to explain the behavior of optimal vector quantizers constructed from l...
متن کاملOn Lloyd’s k-means Method∗
We present polynomial upper and lower bounds on the number of iterations performed by Lloyd’s method for k-means clustering. Our upper bounds are polynomial in the number of points, number of clusters, and the spread of the point set. We also present a lower bound, showing that in the worst case the k-means heuristic needs to perform Ω(n) iterations, for n points on the real line and two center...
متن کاملApplication of K-means learning algorithm to U.N survey data
This paper reflects the results of an implementation of the K-means algorithm on U.N survey data on people’s priorities, organized by country. The dataset includes 16 features for each country, with each feature corresponding to a different societal issue. Each country has a rating in the range of [0, 1] that indicates how important a particular feature or issue is to that country’s people– the...
متن کاملThe Complexity of the k-means Method
The k-means method is a widely used technique for clustering points in Euclidean space. While it is extremely fast in practice, its worst-case running time is exponential in the number of data points. We prove that the k-means method can implicitly solve PSPACE-complete problems, providing a complexity-theoretic explanation for its worst-case running time. Our result parallels recent work on th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: bit-Tech
سال: 2022
ISSN: ['2622-271X', '2622-2728']
DOI: https://doi.org/10.32877/bt.v5i2.562